On Strong Accessibility of the Core of TU Cooperative Game

نویسنده

  • Valery Vasilev
چکیده

In the paper, a strengthening of the core-accessibility theorem by the author is proposed. It is shown that for any imputation outside of the nonempty core of TU cooperative game a strongly monotonic trajectory originating from this imputation exists, which converges to some element of the core. Here, strong monotonicity means that each imputation from the trajectory dominates several preceding elements and, besides, the number of these dominated imputations tends to infinity. To show that transferable utility assumption is relevant for strong accessibility of the core, we give an example of NTU cooperative game with a “black hole” being a nonempty closed subset of dominated imputations that contains all the sequential improvement trajectories originating from its points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel cooperative game between client and subcontractors based on technical characteristics

Large projects often have several activities which are performed by some subcontractors with several skills. Costs and time reduction and quality improvement of the project are very important for client and subcontractors. Therefore, in real large projects, subcontractors join together and form coalitions for improving the project profit. A key question is how an extra profit of cooperation amo...

متن کامل

Using the Core to Predict Coalition Formation

The main objective of this work is to use the defining principles of the core solution concept to determine not only payoffs but coalition formation. Given a cooperative transferable utility (TU) game, we propose two non-cooperative procedures that deliver a natural and non-empty core extension, the aspiration core (Cross 1967, Bennett 1983), together with the supporting coalitions it implies. ...

متن کامل

Extendable cooperative games

A (TU) cooperative game is extendable (Kikuta and Shapley, 1986) if every core allocation of each sub-game can be extended to a core allocation of the game. It is strongly extendable if any minimal vector in the upper core of any of its sub-games can be extended to a core allocation. We prove that strong extendability is equivalent to largeness of the core (Sharkey, 1982). Further, we character...

متن کامل

The minimal dominant set is a non-empty core-extension

A TU-game in characteristic function form generates a unique minimal dominant set. This set is non-empty. For a game with a non-empty core, the core and the minimal dominant set coincide; in this case the core is the smallest (for inclusion) set of outcomes that satisfies accessibility. For an abstract game, the minimal dominant set and Shenoy’s dynamic solution coincide.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016